Henry Schultz

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Art.-Schultz (F)

Current theories view learning as the acquisition of specific predictions1–4. Humans and animals learn to predict the outcomes of their behavior, including rewards. Learning depends on the extent to which these outcomes are different than predicted, being governed by the discrepancy or ‘error’ between outcome and prediction. Outcomes that affect learning in this way are termed ‘reinforcers’. Le...

متن کامل

The Modified Schultz Index of Trees

For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊂V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Lower bounds on modified Schultz index in trees in terms of the order and diameter are determined. Mathematics Subject Classification: 05C05, 05C12

متن کامل

Henry Ormerod

at the age of 68, belonged to a family of surgeons. He was educated at the Bristol Royal Infirmary and Medical School, and very soon after qualifying he settled at Westbury. Although his capacity for work was immense, yet in the early years of his practice he had more than one attack of haemoptysis, and it was his opinion that leading a country open-air life had been the means of warding off mo...

متن کامل

Henry Wellcome

fo'c'sle-study running his naval household with the aid of an Admiralty of natural history suppliers and breeders, as well as experts like Lyell, Hooker and the young Huxley in every port. Beatrice Webb once likened Herbert Spencer to a spider collecting facts on the theoretical web he was spinning; the image equally well suits Darwin. A pleasure to read, this exciting new biography deepens our...

متن کامل

Extremal Modified Schultz Index of Bicyclic Graphs

For a graph G = (V,E), the modified Schultz index of G is defined as S∗(G) = ∑ {u,v}⊆V (G) (dG(u) · dG(v))dG(u, v) where dG(u) (or d(u)) is the degree of the vertex u of G, and dG(u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the modified Schultz index of B(n), graphs in B(n) with the smallest modified Schultz index S∗(G) a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Erkenntnis

سال: 1939

ISSN: 0165-0106,1572-8420

DOI: 10.1007/bf00176023